Similarity relations based on distances as fuzzy concepts
نویسندگان
چکیده
An usual and effective way to define a similarity relation is from a function of distance. Nevertheless, if we consider only usual distances, then some natural kinds of similarity relations cannot be obtained. In this paper, we analyze some of these kinds of similarity relations, and we find non-usual distances in order to obtain these ones.
منابع مشابه
Flexible Query Answering Using Distance-Based Fuzzy Relations
This paper addresses the added value that is provided by using distance-based fuzzy relations in flexible query answering. To use distances and/or concepts of gradual similarity in that domain is not new. Within the last ten years, however, results in the theory of fuzzy relations have emerged that permit a smooth and pragmatic, yet expressive and effective, integration of ordinal concepts too....
متن کاملSimilarity relations in concept lattices 1 RADIM BĚLOHLÁVEK
Abstract. Studied is the issue of similarity relations in fuzzy concept lattices. Fuzzy concepts and fuzzy concept lattices represent a formal approach to the modeling of non-sharp (fuzzy) concepts and conceptual structures in the sense of traditional (PortRoyal) logic. Applications of concept lattices are in representation of conceptual knowledge and in conceptual analysis of (fuzzy) data. Sim...
متن کاملSimilarity relations in concept lattices
This paper studies the issue of similarity relations in fuzzy concept lattices. Fuzzy concepts and fuzzy concept lattices represent a formal approach to the modelling of non-sharp (fuzzy) concepts and conceptual structures in the sense of traditional (Port-Royal) logic. Applications of concept lattices are in representation of conceptual knowledge and in conceptual analysis of (fuzzy) data. Sim...
متن کاملSimilarity Computation in Semantic Nets based on Multiple Concept Relations
Due to the scale and the decentralized nature of the Semantic Web, heterogeneities among concepts used are the rule rather than the exception. To provide a meaningful basis for tasks like reasoning over or discovery of semantic web services, similarity relationships must be defined among them in a semi-automatic way. Similarity computation schemes with single hierarchical concept relations are ...
متن کاملTOPOLOGICAL SIMILARITY OF L-RELATIONS
$L$-fuzzy rough sets are extensions of the classical rough sets by relaxing theequivalence relations to $L$-relations. The topological structures induced by$L$-fuzzy rough sets have opened up the way for applications of topological factsand methods in granular computing. In this paper, we firstly prove thateach arbitrary $L$-relation can generate an Alexandrov $L$-topology.Based on this fact, w...
متن کامل